313C - Ilya and Matrix - CodeForces Solution


constructive algorithms greedy implementation sortings *1400

Please click on ads to support us..

Python Code:

def beauty(a, size):
    if size == 0:
        return max(a)
    else:
        total = max(a) + sum(a)
        b = sorted(a, reverse=True)
        
        power = 1
        while (size-1) > 0:
            total += sum(b[:4 ** power])
            power += 1
            size -= 1
        return total

import math

n = int(input())
a = [int(i) for i in input().split()]
size = int(math.log(n, 4))

print(beauty(a, size))

      		 		 				 		 	  	 	 				


Comments

Submit
0 Comments
More Questions

574A - Bear and Elections
352B - Jeff and Periods
1244A - Pens and Pencils
1670A - Prof Slim
1189A - Keanu Reeves
678A - Johny Likes Numbers
1699C - The Third Problem
1697D - Guess The String
754B - Ilya and tic-tac-toe game
760A - Petr and a calendar
1573A - Countdown
166A - Rank List
1631B - Fun with Even Subarrays
727A - Transformation from A to B
822B - Crossword solving
1623A - Robot Cleaner
884B - Japanese Crosswords Strike Back
862B - Mahmoud and Ehab and the bipartiteness
429A - Xor-tree
1675C - Detective Task
950A - Left-handers Right-handers and Ambidexters
672B - Different is Good
1C - Ancient Berland Circus
721A - One-dimensional Japanese Crossword
1715B - Beautiful Array
60B - Serial Time
453A - Little Pony and Expected Maximum
1715A - Crossmarket
1715C - Monoblock
1512C - A-B Palindrome